The adaptive algorithmic treatment of e-business problems and strategic management methodologies

Two new concepts in a certain class of Strategic Management (SM) methodologies and e-service applications are introduced, namely the adaptive algorithmic concept and the singular perturbation (sp) principle. A synoptic description of these principles is given and their usage in certain SM application problems and selected cases is presented. It is shown that the proposed algorithmic approach greatly facilitates the efficient application of SM methods and techniques for the solution of several e-business problems. The adaptability of the proposed algorithms, through the choice of the sp parameter values and their inherited compactness, allows the efficient (near) optimum solution of a wide class of e-business and SM problems. These adaptive algorithmic techniques can be also particularly effective in the case of solving meta-computing problems. This research work is based on keyfield concepts of three interrelated sciences, i.e. Computer Science (Adaptive Algorithmic Theory), Applied Mathematics (Singular Perturbation Theory and Partial Differential Equations) and Management Science (Strategy Management and e-business). The proposed basic concepts of the first two sciences are applied for and used in connection with problems of e-business and strategic management.